Recovery of Functions From Weak Data Using Unsymmetric Meshless Kernel-Based Methods
نویسنده
چکیده
Recent engineering applications successfully introduced unsymmetric meshless local Petrov-Galerkin (MLPG) schemes. As a step towards their mathematical analysis, this paper investigates nonstationary unsymmetric Petrov-Galerkin-type meshless kernel-based methods for the recovery of L2 functions from finitely many weak data. The results cover solvability conditions and error bounds in negative Sobolev norms with optimal rates. These rates are mainly determined by the approximation properties of the trial space, while choosing sufficiently many test functions ensures stability. Numerical examples are provided, supporting the theoretical results and leading to new questions for future research.
منابع مشابه
Unsymmetric meshless methods for operator equations
A general framework for proving error bounds and convergence of a large class of unsymmetric meshless numerical methods for solving well-posed linear operator equations is presented. The results provide optimal convergence rates, if the test and trial spaces satisfy a stability condition. Operators need not be elliptic, and the problems can be posed in weak or strong form without changing the t...
متن کاملMeshless Local Petrov-Galerkin (MLPG) approaches for solving 3D Problems in elasto-statics
Three different truly Meshless Local Petrov-Galerkin (MLPG) methods are developed for solving 3D elasto-static problems. Using the general MLPG concept, these methods are derived through the local weak forms of the equilibrium equations, by using different test functions, namely, the Heaviside function, the Dirac delta function, and the fundamental solutions. The one with the use of the fundame...
متن کاملConvergence of Unsymmetric Kernel-Based Meshless Collocation Methods
This paper proves convergence of variations of the unsymmetric kernel-based collocation method introduced by E. Kansa in 1986. Since then, this method has been very successfully used in many applications, though it may theoretically fail in special situations, and though it had no error bound or convergence proof up to now. Thus it is necessary to add assumptions or to make modifications. Our m...
متن کاملMultiscale Approximation and Reproducing Kernel Hilbert Space Methods
We consider reproducing kernels K : ⌦ ⇥ ⌦ ! R in multiscale series expansion form, i.e., kernels of the form K (x, y) = P ` 2N`P j2I`` ,j (x) `,j (y) with weightsànd structurally simple basis functions`,i. Here, we deal with basis functions such as polynomials or frame systems, where, for`2 N, the index set I ` is finite or countable. We derive relations between approximation properties of spac...
متن کاملCoupling Projection Domain Decomposition Method and Meshless Collocation Method Using Radial Basis Functions in Electromagnetics
This paper presents an efficient meshless approach for solving electrostatic problems. This novel approach is based on combination of radial basis functions-based meshless unsymmetric collocation method with projection domain decomposition method. Under this new method, we just need to solve a Steklov-Poincaré interface equation and the original problem is solved by computing a series of indepe...
متن کامل